A Memetic Framework for Solving the Lot Sizing and Scheduling Problem in Soft Drink Plants

This chapter presents a memetic framework for solving the Synchronized and Integrated Two-level Lot Sizing and Scheduling Problem (SITLSP). A set of algorithms from this framework is thoroughly evaluated. The SITLSP is a real-world problem typically found in soft drink plants, but its presence can also be seen in many other multi-level production processes. The SITLSP involves a two-level production process where lot sizing and scheduling decisions have to be made for raw material storage in tanks and soft drink bottling in various production lines. The work presented here extends a previously proposed memetic computing approach that combines a multi-population genetic algorithm with a threshold accepting heuristic. The novelty and its main contribution is the use of tabu search combined with the multi-population genetic algorithm as a method to solve the SITLSP. Two real-world problem sets, both provided by a leading market soft drink company, have been used for the computational experiments. The results show that the memetic algorithms proposed significantly outperform the previously reported solutions used for comparison. Claudio F.M. Toledo Institute of Mathematics and Computer Science, University of Sao Paulo, Av. Trabalhador Sao-Carlense, 400, 13566-590, Sao Carlos, SP, Brazil e-mail: [email protected] Marcio S. Arantes Department of Computer Science, University of Lavras, C.P. 3037, 37200-000, Lavras, M.G., Brazil e-mail: [email protected] Paulo M. Franca Department of Mathematics, Statistics and Computing, UNESP, C.P. 266, 19060-900, P. Prudente, SP, Brazil e-mail: [email protected] Reinaldo Morabito Production Engineering Department, Federal University of Sao Carlos, C.P. 676, 13565-905, Sao Carlos, SP, Brazil e-mail: [email protected] 60 C.F.M. Toledo et al.